Graph Pattern Analysis with PatternGravisto
نویسندگان
چکیده
The analysis of patterns in graphs has applications in many fields of science. We propose a new method for analyzing graph patterns consisting of a user-friendly and flexible mechanism to specify patterns, an algorithm to recognize multiple appearances of patterns in a target graph, a pattern preserving layout algorithm, and a navigation technique to explore the underlying structure of the graph given by the patterns. This method has been implemented in a tool called PatternGravisto. We demonstrate the utility of our approach with the example graphs from the Graph Drawing Contest 2003 which cover problems from biology and sociology. Article Type Communicated by Submitted Revised regular paper G. Liotta January 2004 July 2005 This work was supported by the German Ministry of Education and Research (BMBF) under grant 0312706A. Klukas, Koschützki, Schreiber, PatternGravisto, JGAA, 9(1) 19–29 (2005) 20
منابع مشابه
Reverse Engineering State and Strategy Design Patterns using Static Code Analysis
This paper presents an approach to detect behavioral design patterns from source code using static analysis techniques. It depends on the concept of Code Property Graph and enriching graph with relationships and properties specific to Design Patterns, to simplify the process of Design Pattern detection. This approach used NoSQL graph database (Neo4j) and uses graph traversal language (Gremlin) ...
متن کاملA Kind of Non-commuting Graph of Finite Groups
Let g be a fixed element of a finite group G. We introduce the g-noncommuting graph of G whose vertex set is whole elements of the group G and two vertices x,y are adjacent whenever [x,y] g and [y,x] g. We denote this graph by . In this paper, we present some graph theoretical properties of g-noncommuting graph. Specially, we investigate about its planarity and regularity, its clique number a...
متن کاملGraph Hybrid Summarization
One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...
متن کاملWeighted Optimal Path in Graph with Multiple Indexes
This paper represents a technique for finding optimal paths with multiple indexes in a graph. Up to the present time, all optimal paths have been determined upon one index, say, distance for which an evaluation method exists. In this paper firstly we define multiple indexes for each edge in such a way that anyone can treat the factor for assigning an optimal path. Here, we use Data Envelopment ...
متن کاملAnalysis of InGaAsP-InP Double Microring Resonator using Signal Flow Graph Method
The buried hetero-structure (BH) InGaAsP-InP waveguide is used for asystem of double microring resonators (DMR). The light transmission and location ofresonant peaks are determined for six different sets of ring radii with different ordermode numbers. The effect of changing middle coupling coefficient on the box likeresponse is studied. It is found that the surge of coupling coefficient to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 9 شماره
صفحات -
تاریخ انتشار 2005